package com.acyouzi.leetcode.binarysearch;

/**
 * 17/9/13 22:18
 *
 * @author sunxu
 */
public class TrimBinarySearchTree {
  public TreeNode trimBST(TreeNode root, int L, int R) {
    if (root == null) return null;
    if (root.val < L) return trimBST(root.right,L,R);
    if (root.val > R) return trimBST(root.left,L,R);
    root.left = trimBST(root.left,L,R);
    root.right = trimBST(root.right,L,R);
    return root;
  }
}
